High-Performance Sorting Algorithms on AIX
نویسندگان
چکیده
Sorting is a topic which has been studied and researched extensively. Given a number of records and one or more fields as the key, the task is to arrange the records into ascending or descending order. Sorting has been one of the most critical applications on mainframe machines. In this paper we describe our approach of offloading sorting operations from mainframe machines and executing the operations on AIX systems. A library was developed to read records from mainframe DASD disks on an AIX machine and thus make offloading other mainframe operations feasible. We analyze the performance of quick sort and radix sort implementations on AIX using mainframe datasets and find that the sorting operations can be improved up to 70%.
منابع مشابه
Design, Development and Evaluation of an Orange Sorter Based on Machine Vision and Artificial Neural Network Techniques
ABSTRACT- The high production of orange fruit in Iran calls for quality sorting of this product as a requirement for entering global markets. This study was devoted to the development of an automatic fruit sorter based on size. The hardware consisted of two units. An image acquisition apparatus equipped with a camera, a robotic arm and controller circuits. The second unit consisted of a robotic...
متن کاملAn Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملAn automatically-tuned sorting library
We present atsl, an automatically-tuned sorting library. Atsl generates an in-core sorting routine optimized to the target machine for a specific data type. Atsl finds a high-performance sorting routine by searching an algorithmic space that we have defined. The search space includes basic sorting algorithms and automatically-generated compositions of sorting algorithms. Performance measurement...
متن کاملThe In uence of Caches on the Performance of Sorting TR # UW - CSE - 96 - 10 - 01
We investigate the e ect that caches have on the performance of sorting algorithms both experimentally and analytically. To address the performance problems that high cache miss penalties introduce we restructure heapsort, mergesort and quicksort in order to improve their cache locality. For all three algorithms the improvement in cache performance leads to a reduction in total execution time. ...
متن کاملFast Parallel Sorting Algorithms on Gpus
This paper presents a comparative analysis of the three widely used parallel sorting algorithms: OddEven sort, Rank sort and Bitonic sort in terms of sorting rate, sorting time and speed-up on CPU and different GPU architectures. Alongside we have implemented novel parallel algorithm: min-max butterfly network, for finding minimum and maximum in large data sets. All algorithms have been impleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008